Benchmark Problems for Phase Retrieval

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Benchmark problems for phase retrieval

The hardest instances of phase retrieval arise in crystallography, where the signal is periodic and comprised of atomic distributions arranged uniformly in the unit cell of the crystal. We have constructed a graded set of benchmark problems for evaluating algorithms that perform this type of phase retrieval. A simple iterative algorithm was used to establish baseline runtimes that empirically g...

متن کامل

Phase retrieval for imaging problems

We study convex relaxation algorithms for phase retrieval on imaging problems. We show that exploiting structural assumptions on the signal and the observations, such as sparsity, smoothness or positivity, can significantly speed-up convergence and improve recovery performance. We detail numerical results in molecular imaging experiments simulated using data from the Protein Data Bank (PDB).

متن کامل

Phase Retrieval Problems

Phase retrieval problems arise in various fields of applied physics and engineering, such as crystallography, electron microscopy, astronomy, and optics (see [11, 12, 17, 23, 25]). An abstract phase retrieval problem is stated as follows: Find a well–localized smooth complex-valued function f for given moduli |f | and |f̂ |. Here f̂ denotes the Fourier transform of f . Thus the problem is to find...

متن کامل

Problems with Running a Successful Multimedia Retrieval Benchmark

Content-based image retrieval (CBIR) and multimedia retrieval are at the point where they are ready to leave the pure research status and become integrated into commercial prototypes and products. This requires techniques not only to be interesting as theoretical approaches but also to be comparable with respect to performance obtained. Similar to the text retrieval domain many years ago, sever...

متن کامل

Benchmark Problems for Constraint Solving

Constraint Programming is roughly a new software technology introduced by Jaffar and Lassez in 1987 for description and effective solving of large, particularly combinatorial, problems especially in areas of planning and scheduling. In the following we define three problems for constraint solving from the domain of electrical networks; based on them we define 43 related problems. For the define...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Imaging Sciences

سال: 2018

ISSN: 1936-4954

DOI: 10.1137/18m1170364